Binding in Nominal Equational Logic

Many formal systems, particularly in computer science, may be expressed through equations modulated by assertions regarding the ‘freshness of names’. It is the presence of binding operators that make such structure non-trivial. Clouston and Pitts’s Nominal Equational Logic presented a formalism for this style of reasoning in which support for name binding was implicit. This paper extends this logic to offer explicit support for binding and then demonstrates that such an extension does not in fact add expressivity.